Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
نویسندگان
چکیده
In this paper, we present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding a graph metric into a tree metric (thus improving and simplifying the factor 100 and 27 algorithms of Bǎdoiu, Indyk, and Sidiropoulos (2007) and Bǎdoiu, Demaine, Hajiaghayi, Sidiropoulos, and Zadimoghaddam (2008)). We also present a constant factor algorithm for approximating the optimal distortion of embedding a graph metric into an outerplanar metric. For this, we introduce a general notion of metric relaxed minor and show that if G contains an α-metric relaxed H-minor, then the distortion of any embedding of G into any metric induced by a H-minor free graph is ≥ α. Then, for H = K2,3, we present an algorithm which either finds an α-relaxed minor, or produces an O(α)-embedding into an outerplanar metric.
منابع مشابه
D - Width , Metric Embedding , and Their Connections
Embedding between metric spaces is a very powerful algorithmic tool and has been used for finding good approximation algorithms for several problems. In particular, embedding to an l1 norm has been used as the key step in an approximation algorithm for the sparsest cut problem. The sparsest cut problem, in turn, is the main ingredient of many algorithms that have a divide and conquer nature and...
متن کاملEmbedding K-outerplanar Graphs into 1 *
We show that the shortest-path metric of any k-outerplanar graph, for any fixed k, can be approximated by a probability distribution over tree metrics with constant distortion and hence also embedded into 1 with constant distortion. These graphs play a central role in polynomial time approximation schemes for many NP-hard optimization problems on general planar graphs and include the family of ...
متن کاملI/O-Optimal Algorithms for Outerplanar Graphs
We present linear-I/O algorithms for fundamental graph problems on embedded outerplanar graphs. We show that breadth-first search, depth-first search, single-source shortest paths, triangulation, and computing an separator of size O(1/ ) take O(scan(N)) I/Os on embedded outerplanar graphs. We also show that it takes O(sort(N)) I/Os to test whether a given graph is outerplanar and to compute an ...
متن کاملSteiner Point Removal in Graph Metrics
Given a family of graphs F , and graph G ∈ F with weights on the edges, the vertices of G are partitioned into terminals T and Steiner nodes S. The shortest paths (according to edge weights) define a metric on the set of vertices. We wish to embed the set T in a weighted graph G′ ∈ F such that the distance between any two vertices x, y ∈ T in the graph G′ is “close” to their distance in G. More...
متن کاملEliminating Steiner Vertices in Graph Metrics
Given an edge-weighted undirected graph G and a subset of “required” vertices R ⊆ V (G), called the terminals, we want to find a minor G′ with possibly different edge-weights, that retains distances between all terminal-pairs exactly, and is as small as possible. We prove that every graph G with n vertices and k terminals can be reduced (in this sense) to a minor G′ with O(k4) vertices and edge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 47 شماره
صفحات -
تاریخ انتشار 2010